Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

Abstract. This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs. Given an interval model with endpoints sorted, these algorithms run in time O(n) orO(n log log n) where n is the number of vertices. The results are then extended to solve the same problems on circular-arc graphs in O(n + m) time where m is the number of edges of the input graph

An improved algorithm for the red-blue hitting set problem with the consecutive ones property

[[notice]]補正完

An improved algorithm for the red-blue hitting set problem with the consecutive ones property

[[notice]]補正完

On 3-Steiner Root Problem

[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;有審查制度;具代表

A simple linear algorithm for the connected domination problem in circular-arc graphs

A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(|F|) time